17 ideas
13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
13128 | 'Ultimate sortals' cannot explain ontological categories [Westerhoff on Wiggins] |